Solving the Balanced Academic Curriculum Problem with an Hybridization of Genetic Algorithm and Constraint Propagation
نویسندگان
چکیده
In this paper, we are concerned with the design of a hybrid resolution framework including genetic algorithms and constraint propagation to solve the balanced academic curriculum problem. We develop a theoretical model in which hybrid resolution can be achieved as the computation of a fixpoint of elementary functions. These functions correspond to basic resolution techniques and their applications can easily be parameterized by different search strategies. This framework is used to solve a specific problem and we discuss the experimental results showing the interest of the of the model to design such hybridizations.
منابع مشابه
Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملHybridization of Genetic Algorithms and Constraint Propagation for the BACP
Constraint Satisfaction Problems (CSP) provide a modelling framework for many computer aided decision making problems. Many of these problems are associated to an optimization criterion. Solving a CSP consists in finding an assignment of values to the variables that satisfies the constraints and optimizes a given objective function (in case of an optimization problem). In this paper, we extend ...
متن کاملYard crane scheduling in port container terminals using genetic algorithm
Yard crane is an important resource in container terminals. Efficient utilization of the yard crane significantly improves the productivity and the profitability of the container terminal. This paper presents a mixed integer programming model for the yard crane scheduling problem with non- interference constraint that is NPHARD in nature. In other words, one of the most important constraints in...
متن کاملVariable and Value Ordering When Solving Balanced Academic Curriculum Problems
In this paper we present the use of Constraint Programming for solving balanced academic curriculum problems. We discuss the important role that heuristics play when solving a problem using a constraint-based approach. We also show how constraint solving techniques allow to very efficiently solve combinatorial optimization problems that are too hard for integer programming techniques.
متن کاملA CP Approach to the Balanced Academic Curriculum Problem
The Balanced Academic Curriculum Problem (BACP) has received little attention in Constraint Programming. Only a few articles deals with this problem with experimental results on the three small instances publicly available in CSPLIB. The present article describes an approach to efficiently solve this challenging problem. Optimal solutions are produced on a variety of randomly generated instance...
متن کامل